منابع مشابه
Regularization by dynamic programming
We investigate continuous regularization methods for linear inverse problems of static and dynamic type. These methods are based on dynamic programming approaches for linear quadratic optimal control problems. We prove regularization properties and also obtain rates of convergence for our methods. A numerical example concerning a dynamical electrical impedance tomography (EIT) problem is used t...
متن کاملDynamic Programming by Dimitri
Dynamic Programming by Dimitri P. Bertsekas Massachusetts Institute of Technology Chapter 4 Noncontractive Models UPDATED July 17, 2017 This is an updated version of Chapter 4 of the author’s research monograph “Abstract Dynamic Programming,” Athena Scientific, 2013. It replaces Sections 4.4-4.7 of the original with new material. The chapter will be periodically updated, and represents “work in...
متن کاملaras dam reservoir operation model by using of dynamic programming
this article aims at designing the mathematical model for aras dam reservoir in time operation with missions of agriculture needs safeguarding, water electric energy production and torrent controls. reservoir system relations determinate and these relations at framework of are determined and stochastic dynamic programming are calculated executive results of this model are presentation of guides...
متن کاملRegularization Methods for Semidefinite Programming
We introduce a new class of algorithms for solving linear semidefinite programming (SDP) problems. Our approach is based on classical tools from convex optimization such as quadratic regularization and augmented Lagrangian techniques. We study the theoretical properties and we show that practical implementations behave very well on some instances of SDP having a large number of constraints. We ...
متن کاملApproximate Counting by Dynamic Programming
This proposal describes a project that is going to investigate algorithms for counting knapsack solutions and related sets, with a focus on algorithms that utilise dynamic programming. Both the feasibility of the implementation and the performance characteristics of the algorithms are going to be examined; additional goals pertain to actual algorithmic improvements, with derandomisation being t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inverse and Ill-posed Problems
سال: 2007
ISSN: 0928-0219,1569-3945
DOI: 10.1515/jiip.2007.016